Fractional Covers of Hypergraphs with Bounded Multi-Intersection

نویسندگان

چکیده

Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued invariants are considered. The focus this paper on edge covers hypergraphs. Our main technical result generalizes and unifies previous conditions under which size support bounded independently hypergraph itself. This allows us to extend tractability results for checking if hypertree width a given $\leq k$ some constant $k$. We also show how our translate vertex covers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypergraphs of Bounded Disjointness

A k-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s other edges. Gerbner, Lemons, Palmer, Patkós and Szécsi conjectured that for every k, and s > s0(k), every k-uniform s-almost intersecting hypergraph has at most (s + 1) ( 2k−2 k−1 ) edges. We prove a strengthened version of this conjecture and determine the extremal graphs. We also give some related result...

متن کامل

On Helly Hypergraphs with Variable Intersection Sizes

A hypergraphH is said to be p-Helly when every p-wise intersecting partial hypergraph H′ of H has nonempty total intersection. Such hypergraphs have been characterized by Berge and Duchet in 1975, and since then they have appeared in the literature in several contexts, especially for the case p = 2, in which they are referred simply as Helly hypergraphs. An interesting generalization of p-Helly...

متن کامل

Generating dual-bounded hypergraphs

This paper surveys some recent results on the generation of implicitly given hypergraphs and their applications in Boolean and integer programming, data mining, reliability theory, and combinatorics. Given a monotone property π over the subsets of a finite set V , we consider the problem of incrementally generating the family Fπ of all minimal subsets satisfying property π, when π is given by a...

متن کامل

Bicoloring covers for graphs and hypergraphs

Let the bicoloring cover number χ(G) for a hypergraph G(V,E) be the minimum number of bicolorings of vertices of G such that every hyperedge e ∈ E of G is properly bicolored in at least one of the χ(G) bicolorings. We establish a tight bound for χ(K n), where K n is the complete k-uniform hypergraph on n vertices. We investigate the relationship between χ(G), matchings, hitting sets, α(G)(indep...

متن کامل

Biased Positional Games and Small Hypergraphs with Large Covers

We prove that in the biased (1 : b) Hamiltonicity and k-connectivity MakerBreaker games (k > 0 is a constant), played on the edges of the complete graph Kn, Maker has a winning strategy for b ≤ (log 2− o(1))n/ log n. Also, in the biased (1 : b) Avoider-Enforcer game played on E(Kn), Enforcer can force Avoider to create a Hamilton cycle when b ≤ (1− o(1))n/ log n. These results are proved using ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Science Research Network

سال: 2022

ISSN: ['1556-5068']

DOI: https://doi.org/10.2139/ssrn.4091247